Reload cost trees and network design

نویسندگان

  • Ioannis Gamvros
  • Luís Gouveia
  • S. Raghavan
چکیده

In this paper we consider the notion of “reload costs” in network design. Reload costs occur in telecommunication networks using diverse technologies. For example, one of the products offered by commercial satellite service providers and their partners is a virtual private network (VPN) that can offer voice, video and data connectivity between all of the geographically dispersed locations of large corporate, government and military organizations. Typically, these VPNs are made up of satellite links and fiber optic cables. The use of diverse technologies at different junctions of the VPN results in an extra cost component (i.e., in addition to typical routing costs) that is associated with the equipment required to seamlessly bind them together. These interface costs are referred to as reload costs and depend on the technologies being connected. Moreover, these costs can sometimes dominate other costs such as the regular routing costs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reload cost problems: minimum diameter spanning tree

We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...

متن کامل

On the Complexity of Constructing Minimum Reload Cost Path-Trees

The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. The reload cost depends only on the colors of the traversed edges. Previous work on reload costs focuses on the problem of finding a spanning tree that minimizes the total reload cost from a source vertex to all othe...

متن کامل

Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter

We study the minimum diameter spanning tree problem under the reload cost model (DiameterTree for short) introduced by Wirth and Steffan (2001). In this problem, given an undirected edge-colored graph G, reload costs on a path arise at a node where the path uses consecutive edges of different colors. The objective is to find a spanning tree of G of minimum diameter with respect to the reload co...

متن کامل

Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs

Given an edge-colored graph, a vertex on a path experiences a reload cost if it lies between two consecutive edges of different colors. The value of the reload cost depends only on the colors of the traversed edges. Reload cost has important applications in dynamic networks, such as transportation networks and dynamic spectrum access networks. In the minimum changeover cost arborescence (MinCCA...

متن کامل

Edge Coloring with Minimum Reload/Changeover Costs

In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are traversed. The value of the traversal cost depends only on the colors of the traversed edges. This concept leads to two global cost measures, namely the reload cost and the changeover cost, that have been studied in the literature and have various applications in telecommu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Networks

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2012